Confidential Data Aggregation in Wireless Sensor Networks Using Coding Theory

Wireless sensor networks are recently receiving substantial attention due to their unlimited potency. The data aggregation scheme provides better security as cluster head perform aggregation on cipher text directly without decryption, accordingly transmission overhead is reduced. We propose the aggregation scheme based on coding theory. McEliece public key encryption based on coding is providing the best alternate for cryptosystem. They leverage error correcting codes as a mechanism for encryption. Different from RSA and ELGAMAL, quantum computer cannot break the McEliece public key cryptosystem and here encryption and decryption operations are more efficient and even secure against chosen cipher text attacks

A Modified Symmetric Key Fully Homomorphic Encryption Scheme Based on Read-Muller Code

Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security.   We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly.   We make an effort to prove the security of the scheme under indistinguishability under chosen-plaintext attack (IND-CPA) through a game-based security proof. The security proof gives a mathematical analysis and its complexity of hardness. Also, it presents security analysis against all the known attacks with respect to the message expansion and homomorphic operations